Let S be a foundation semigroup with identity and Ma(S) be its semigroup algebra. In this paper, we give necessary and su cient conditions for the existence of a bounded approxi-mate identity in closed codimension one ideals of semigroup algebra Ma(S) of a locally compact topological foundation semigroup with identity.

The problem of personal identity among others may stem from the following question—what does be the person that you are, from one day to the next, necessarily consist of? The diachronic problem of personal identity raises question on the necessary and sufficient conditions for the identity of the person over time. The synchronic problem is grounded in the question of what features or traits characterize a given person at one time. To answer these questions, John Locke discarded the soul and the body as necessary and sufficient substances for personal identity over time. He accepted consciousness as the only criterion for personal identity; the only thing capable of remaining the same and preserving personal identity through change. Though Locke’s argument is somewhat clear and coherent but what remains vague and incoherent is embedded in the question—what exactly is consciousness? How and why should it be the basis or criterion for the determination of personal identity? Using the method of critical analysis, I argue that Locke’s choice of consciousness as the determinant of personal identity, though quite novel, is incoherent and vague. Secondly, Locke had already presumed and anticipated clearly though fallaciously the very thing he wishes to substantiate. I therefore conclude that Locke’s argument is just another way of trying to escape but inadvertently prolonging the difficulty of apparently articulating a distinction between the psychological approach and physiological approach to the problem of personal identity. However, in my submission, I propose the concept of the “other” as alternative approach— a sort of an extrinsic-intrinsic approach to the problem of personal identity.

The current research was conducted with the aim of the effect of attachment style on emotion regulation with the mediating role of identity style. The research method was descriptive and structural equation analysis. The statistical population of the research was all second year high school students of Kashan city in the academic year of 1400-1401, of which 500 people were selected by random cluster method. Data were collected based on three questionnaires: Gross & Jan (2003) Emotional Regulation Inventory, identity Style Scale (6G-ISI) and Collins and Reid (1990) Attachment Style Questionnaire. The data are obtained by structural equation modeling and using Laserl 8.8 and 26 spss software. analyzed. Based on the results, secure attachment style at a significance level of 0.01, avoidant attachment style at a significance level of 0.05, and ambivalent attachment style at a significance level of 0.01 directly predicted emotion regulation. Among the three attachments, secure attachment style predicted emotion regulation at a significant level of 0.01, with the mediation of identity styles. Informational identity style at a significance level of 0.01, confused identity style at a significance level of 0.05 directly predicted emotion regulation. Among the three attachments, only the secure attachment style at a significance level of 0.01 had a significant role in predicting the normative identity style. According to the results of this study, emotion regulation is one of the most important constructs of educational psychology and an important factor in determining mental health and successful performance. It is in education that the factors affecting emotion regulation and its antecedents should be identified. Planning for training and holding educational workshops in this field in schools is suggested for students.

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error patterns. In field matching phase, edit distance method is used. Naturally, it had been customized for Persian language problems such as similarity of Persian characters, usual typographical errors in Persian, etc. In record matching phase, the importance of each field can be determined by specifying a coefficient related to each field. Coefficient of each field must be dynamically changed, because of changes of typographical error patterns. For this reason, Genetic Algorithm (GA) is used for supervised learning of coefficient values. The simulation results show the high abilities of this algorithm compared with other methods (such as Decision Trees).

In this paper, we prove that every orthogonally higher ring derivation is a higher ring derivation. Also we find the general solution of the pexider orthogonally higher ring derivations {fn(x + y) = gn(x) + hn(y), = 0, {fn(xy) =∑, i+j=n gi (x)hj (y). Then we prove that for any Approximate pexider orthogonally higher ring derivation under some control functions φ, (x, y) and ψ, (x, y), there exists a unique higher ring derivation D = {dn}∞,n=0, near {fn}∞,n=0, {gn}∞,n=0 and {hn}∞,n=0 estimated by φ,and ψ, .

Results concerning local boundedness of operators have a long history. In 1994, Vesel, y connected the concept of Approximate monotonicity of an operator with local boundedness of that. It is our desire in this note to characterize an Approximate monotone operator. Actually, we show that a well-known property of monotone operators, namely representing by convex functions, remains valid for the larger subclass of operators. In this general framework we establish the similar results by Fitzpatrick. Also, celebrated results of Mart, inez-Legaz and Th, era inspired us to prove that the set of maximal "-monotone operators between a normed linear space X and its continuous dual X,can be identi, ed as some subset of convex functions on X ,X, .